Termination w.r.t. Q proof of /tmp/aprove_benchmark_example

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNat(V1), V2))
U12¹(mark(X)) → U12¹(X)
MARK(tt) → ACTIVE(tt)
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(U11(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(plus(N, s(M))) → U41¹(isNat(M), M, N)
U42¹(mark(X1), X2, X3) → U42¹(X1, X2, X3)
MARK(U21(X)) → U21¹(mark(X))
MARK(U42(X1, X2, X3)) → U42¹(mark(X1), X2, X3)
U41¹(mark(X1), X2, X3) → U41¹(X1, X2, X3)
U11¹(X1, mark(X2)) → U11¹(X1, X2)
U31¹(active(X1), X2) → U31¹(X1, X2)
ACTIVE(plus(N, s(M))) → ISNAT(M)
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
U12¹(active(X)) → U12¹(X)
U31¹(X1, active(X2)) → U31¹(X1, X2)
U11¹(X1, active(X2)) → U11¹(X1, X2)
S(active(X)) → S(X)
ACTIVE(U11(tt, V2)) → U12¹(isNat(V2))
U31¹(mark(X1), X2) → U31¹(X1, X2)
MARK(U41(X1, X2, X3)) → MARK(X1)
U31¹(X1, mark(X2)) → U31¹(X1, X2)
MARK(U41(X1, X2, X3)) → U41¹(mark(X1), X2, X3)
U21¹(mark(X)) → U21¹(X)
ACTIVE(U42(tt, M, N)) → PLUS(N, M)
ACTIVE(U11(tt, V2)) → MARK(U12(isNat(V2)))
U42¹(X1, mark(X2), X3) → U42¹(X1, X2, X3)
ACTIVE(U31(tt, N)) → MARK(N)
MARK(U12(X)) → ACTIVE(U12(mark(X)))
MARK(U42(X1, X2, X3)) → MARK(X1)
U11¹(mark(X1), X2) → U11¹(X1, X2)
ACTIVE(U41(tt, M, N)) → U42¹(isNat(N), M, N)
U42¹(X1, X2, mark(X3)) → U42¹(X1, X2, X3)
ACTIVE(U42(tt, M, N)) → S(plus(N, M))
MARK(U12(X)) → MARK(X)
MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
ACTIVE(U41(tt, M, N)) → ISNAT(N)
MARK(s(X)) → MARK(X)
PLUS(active(X1), X2) → PLUS(X1, X2)
U42¹(active(X1), X2, X3) → U42¹(X1, X2, X3)
ACTIVE(plus(N, 0)) → ISNAT(N)
ACTIVE(plus(N, 0)) → MARK(U31(isNat(N), N))
PLUS(mark(X1), X2) → PLUS(X1, X2)
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U31(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X2)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(U11(X1, X2)) → U11¹(mark(X1), X2)
ACTIVE(isNat(0)) → MARK(tt)
U41¹(X1, X2, active(X3)) → U41¹(X1, X2, X3)
ACTIVE(isNat(s(V1))) → U21¹(isNat(V1))
ACTIVE(plus(N, 0)) → U31¹(isNat(N), N)
MARK(U31(X1, X2)) → U31¹(mark(X1), X2)
MARK(s(X)) → ACTIVE(s(mark(X)))
U41¹(active(X1), X2, X3) → U41¹(X1, X2, X3)
PLUS(X1, mark(X2)) → PLUS(X1, X2)
ACTIVE(U21(tt)) → MARK(tt)
PLUS(X1, active(X2)) → PLUS(X1, X2)
U41¹(X1, active(X2), X3) → U41¹(X1, X2, X3)
U11¹(active(X1), X2) → U11¹(X1, X2)
MARK(U11(X1, X2)) → ACTIVE(U11(mark(X1), X2))
S(mark(X)) → S(X)
MARK(s(X)) → S(mark(X))
MARK(U12(X)) → U12¹(mark(X))
U42¹(X1, X2, active(X3)) → U42¹(X1, X2, X3)
U42¹(X1, active(X2), X3) → U42¹(X1, X2, X3)
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(plus(X1, X2)) → MARK(X1)
ISNAT(active(X)) → ISNAT(X)
ISNAT(mark(X)) → ISNAT(X)
ACTIVE(isNat(plus(V1, V2))) → ISNAT(V1)
U21¹(active(X)) → U21¹(X)
MARK(U21(X)) → MARK(X)
ACTIVE(plus(N, s(M))) → MARK(U41(isNat(M), M, N))
ACTIVE(isNat(plus(V1, V2))) → U11¹(isNat(V1), V2)
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))
ACTIVE(U11(tt, V2)) → ISNAT(V2)
ACTIVE(isNat(s(V1))) → ISNAT(V1)
MARK(0) → ACTIVE(0)
U41¹(X1, X2, mark(X3)) → U41¹(X1, X2, X3)
U41¹(X1, mark(X2), X3) → U41¹(X1, X2, X3)
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))
MARK(plus(X1, X2)) → PLUS(mark(X1), mark(X2))
ACTIVE(U12(tt)) → MARK(tt)

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNat(V1), V2))
U12¹(mark(X)) → U12¹(X)
MARK(tt) → ACTIVE(tt)
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(U11(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(plus(N, s(M))) → U41¹(isNat(M), M, N)
U42¹(mark(X1), X2, X3) → U42¹(X1, X2, X3)
MARK(U21(X)) → U21¹(mark(X))
MARK(U42(X1, X2, X3)) → U42¹(mark(X1), X2, X3)
U41¹(mark(X1), X2, X3) → U41¹(X1, X2, X3)
U11¹(X1, mark(X2)) → U11¹(X1, X2)
U31¹(active(X1), X2) → U31¹(X1, X2)
ACTIVE(plus(N, s(M))) → ISNAT(M)
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
U12¹(active(X)) → U12¹(X)
U31¹(X1, active(X2)) → U31¹(X1, X2)
U11¹(X1, active(X2)) → U11¹(X1, X2)
S(active(X)) → S(X)
ACTIVE(U11(tt, V2)) → U12¹(isNat(V2))
U31¹(mark(X1), X2) → U31¹(X1, X2)
MARK(U41(X1, X2, X3)) → MARK(X1)
U31¹(X1, mark(X2)) → U31¹(X1, X2)
MARK(U41(X1, X2, X3)) → U41¹(mark(X1), X2, X3)
U21¹(mark(X)) → U21¹(X)
ACTIVE(U42(tt, M, N)) → PLUS(N, M)
ACTIVE(U11(tt, V2)) → MARK(U12(isNat(V2)))
U42¹(X1, mark(X2), X3) → U42¹(X1, X2, X3)
ACTIVE(U31(tt, N)) → MARK(N)
MARK(U12(X)) → ACTIVE(U12(mark(X)))
MARK(U42(X1, X2, X3)) → MARK(X1)
U11¹(mark(X1), X2) → U11¹(X1, X2)
ACTIVE(U41(tt, M, N)) → U42¹(isNat(N), M, N)
U42¹(X1, X2, mark(X3)) → U42¹(X1, X2, X3)
ACTIVE(U42(tt, M, N)) → S(plus(N, M))
MARK(U12(X)) → MARK(X)
MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
ACTIVE(U41(tt, M, N)) → ISNAT(N)
MARK(s(X)) → MARK(X)
PLUS(active(X1), X2) → PLUS(X1, X2)
U42¹(active(X1), X2, X3) → U42¹(X1, X2, X3)
ACTIVE(plus(N, 0)) → ISNAT(N)
ACTIVE(plus(N, 0)) → MARK(U31(isNat(N), N))
PLUS(mark(X1), X2) → PLUS(X1, X2)
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U31(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X2)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(U11(X1, X2)) → U11¹(mark(X1), X2)
ACTIVE(isNat(0)) → MARK(tt)
U41¹(X1, X2, active(X3)) → U41¹(X1, X2, X3)
ACTIVE(isNat(s(V1))) → U21¹(isNat(V1))
ACTIVE(plus(N, 0)) → U31¹(isNat(N), N)
MARK(U31(X1, X2)) → U31¹(mark(X1), X2)
MARK(s(X)) → ACTIVE(s(mark(X)))
U41¹(active(X1), X2, X3) → U41¹(X1, X2, X3)
PLUS(X1, mark(X2)) → PLUS(X1, X2)
ACTIVE(U21(tt)) → MARK(tt)
PLUS(X1, active(X2)) → PLUS(X1, X2)
U41¹(X1, active(X2), X3) → U41¹(X1, X2, X3)
U11¹(active(X1), X2) → U11¹(X1, X2)
MARK(U11(X1, X2)) → ACTIVE(U11(mark(X1), X2))
S(mark(X)) → S(X)
MARK(s(X)) → S(mark(X))
MARK(U12(X)) → U12¹(mark(X))
U42¹(X1, X2, active(X3)) → U42¹(X1, X2, X3)
U42¹(X1, active(X2), X3) → U42¹(X1, X2, X3)
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(plus(X1, X2)) → MARK(X1)
ISNAT(active(X)) → ISNAT(X)
ISNAT(mark(X)) → ISNAT(X)
ACTIVE(isNat(plus(V1, V2))) → ISNAT(V1)
U21¹(active(X)) → U21¹(X)
MARK(U21(X)) → MARK(X)
ACTIVE(plus(N, s(M))) → MARK(U41(isNat(M), M, N))
ACTIVE(isNat(plus(V1, V2))) → U11¹(isNat(V1), V2)
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))
ACTIVE(U11(tt, V2)) → ISNAT(V2)
ACTIVE(isNat(s(V1))) → ISNAT(V1)
MARK(0) → ACTIVE(0)
U41¹(X1, X2, mark(X3)) → U41¹(X1, X2, X3)
U41¹(X1, mark(X2), X3) → U41¹(X1, X2, X3)
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))
MARK(plus(X1, X2)) → PLUS(mark(X1), mark(X2))
ACTIVE(U12(tt)) → MARK(tt)

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 10 SCCs with 27 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ UsableRulesProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PLUS(active(X1), X2) → PLUS(X1, X2)
PLUS(mark(X1), X2) → PLUS(X1, X2)
PLUS(X1, mark(X2)) → PLUS(X1, X2)
PLUS(X1, active(X2)) → PLUS(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QDPSizeChangeProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PLUS(active(X1), X2) → PLUS(X1, X2)
PLUS(mark(X1), X2) → PLUS(X1, X2)
PLUS(X1, mark(X2)) → PLUS(X1, X2)
PLUS(X1, active(X2)) → PLUS(X1, X2)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

PLUS(active(X1), X2) → PLUS(X1, X2)
The graph contains the following edges 1 > 1, 2 >= 2
PLUS(mark(X1), X2) → PLUS(X1, X2)
The graph contains the following edges 1 > 1, 2 >= 2
PLUS(X1, mark(X2)) → PLUS(X1, X2)
The graph contains the following edges 1 >= 1, 2 > 2
PLUS(X1, active(X2)) → PLUS(X1, X2)
The graph contains the following edges 1 >= 1, 2 > 2

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S(mark(X)) → S(X)
S(active(X)) → S(X)

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QDPSizeChangeProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

S(active(X)) → S(X)
S(mark(X)) → S(X)

From the DPs we obtained the following set of size-change graphs:

S(mark(X)) → S(X)
The graph contains the following edges 1 > 1
S(active(X)) → S(X)
The graph contains the following edges 1 > 1

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U42¹(X1, X2, active(X3)) → U42¹(X1, X2, X3)
U42¹(X1, active(X2), X3) → U42¹(X1, X2, X3)
U42¹(mark(X1), X2, X3) → U42¹(X1, X2, X3)
U42¹(active(X1), X2, X3) → U42¹(X1, X2, X3)
U42¹(X1, X2, mark(X3)) → U42¹(X1, X2, X3)
U42¹(X1, mark(X2), X3) → U42¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QDPSizeChangeProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U42¹(X1, X2, active(X3)) → U42¹(X1, X2, X3)
U42¹(X1, active(X2), X3) → U42¹(X1, X2, X3)
U42¹(mark(X1), X2, X3) → U42¹(X1, X2, X3)
U42¹(active(X1), X2, X3) → U42¹(X1, X2, X3)
U42¹(X1, X2, mark(X3)) → U42¹(X1, X2, X3)
U42¹(X1, mark(X2), X3) → U42¹(X1, X2, X3)

From the DPs we obtained the following set of size-change graphs:

U42¹(X1, X2, active(X3)) → U42¹(X1, X2, X3)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3
U42¹(X1, active(X2), X3) → U42¹(X1, X2, X3)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3
U42¹(mark(X1), X2, X3) → U42¹(X1, X2, X3)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3
U42¹(active(X1), X2, X3) → U42¹(X1, X2, X3)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3
U42¹(X1, X2, mark(X3)) → U42¹(X1, X2, X3)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3
U42¹(X1, mark(X2), X3) → U42¹(X1, X2, X3)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U41¹(X1, X2, active(X3)) → U41¹(X1, X2, X3)
U41¹(X1, active(X2), X3) → U41¹(X1, X2, X3)
U41¹(X1, X2, mark(X3)) → U41¹(X1, X2, X3)
U41¹(X1, mark(X2), X3) → U41¹(X1, X2, X3)
U41¹(active(X1), X2, X3) → U41¹(X1, X2, X3)
U41¹(mark(X1), X2, X3) → U41¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QDPSizeChangeProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U41¹(X1, X2, active(X3)) → U41¹(X1, X2, X3)
U41¹(X1, active(X2), X3) → U41¹(X1, X2, X3)
U41¹(X1, mark(X2), X3) → U41¹(X1, X2, X3)
U41¹(X1, X2, mark(X3)) → U41¹(X1, X2, X3)
U41¹(active(X1), X2, X3) → U41¹(X1, X2, X3)
U41¹(mark(X1), X2, X3) → U41¹(X1, X2, X3)

From the DPs we obtained the following set of size-change graphs:

U41¹(X1, X2, active(X3)) → U41¹(X1, X2, X3)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3
U41¹(X1, active(X2), X3) → U41¹(X1, X2, X3)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3
U41¹(X1, X2, mark(X3)) → U41¹(X1, X2, X3)
The graph contains the following edges 1 >= 1, 2 >= 2, 3 > 3
U41¹(X1, mark(X2), X3) → U41¹(X1, X2, X3)
The graph contains the following edges 1 >= 1, 2 > 2, 3 >= 3
U41¹(active(X1), X2, X3) → U41¹(X1, X2, X3)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3
U41¹(mark(X1), X2, X3) → U41¹(X1, X2, X3)
The graph contains the following edges 1 > 1, 2 >= 2, 3 >= 3

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U31¹(X1, active(X2)) → U31¹(X1, X2)
U31¹(active(X1), X2) → U31¹(X1, X2)
U31¹(mark(X1), X2) → U31¹(X1, X2)
U31¹(X1, mark(X2)) → U31¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QDPSizeChangeProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U31¹(X1, active(X2)) → U31¹(X1, X2)
U31¹(active(X1), X2) → U31¹(X1, X2)
U31¹(mark(X1), X2) → U31¹(X1, X2)
U31¹(X1, mark(X2)) → U31¹(X1, X2)

From the DPs we obtained the following set of size-change graphs:

U31¹(X1, active(X2)) → U31¹(X1, X2)
The graph contains the following edges 1 >= 1, 2 > 2
U31¹(active(X1), X2) → U31¹(X1, X2)
The graph contains the following edges 1 > 1, 2 >= 2
U31¹(mark(X1), X2) → U31¹(X1, X2)
The graph contains the following edges 1 > 1, 2 >= 2
U31¹(X1, mark(X2)) → U31¹(X1, X2)
The graph contains the following edges 1 >= 1, 2 > 2

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U21¹(mark(X)) → U21¹(X)
U21¹(active(X)) → U21¹(X)

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QDPSizeChangeProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U21¹(mark(X)) → U21¹(X)
U21¹(active(X)) → U21¹(X)

From the DPs we obtained the following set of size-change graphs:

U21¹(mark(X)) → U21¹(X)
The graph contains the following edges 1 > 1
U21¹(active(X)) → U21¹(X)
The graph contains the following edges 1 > 1

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ISNAT(active(X)) → ISNAT(X)
ISNAT(mark(X)) → ISNAT(X)

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QDPSizeChangeProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ISNAT(active(X)) → ISNAT(X)
ISNAT(mark(X)) → ISNAT(X)

From the DPs we obtained the following set of size-change graphs:

ISNAT(active(X)) → ISNAT(X)
The graph contains the following edges 1 > 1
ISNAT(mark(X)) → ISNAT(X)
The graph contains the following edges 1 > 1

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U12¹(mark(X)) → U12¹(X)
U12¹(active(X)) → U12¹(X)

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QDPSizeChangeProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U12¹(mark(X)) → U12¹(X)
U12¹(active(X)) → U12¹(X)

From the DPs we obtained the following set of size-change graphs:

U12¹(mark(X)) → U12¹(X)
The graph contains the following edges 1 > 1
U12¹(active(X)) → U12¹(X)
The graph contains the following edges 1 > 1

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U11¹(X1, mark(X2)) → U11¹(X1, X2)
U11¹(X1, active(X2)) → U11¹(X1, X2)
U11¹(active(X1), X2) → U11¹(X1, X2)
U11¹(mark(X1), X2) → U11¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ UsableRulesProof

              ↳ QDP

                ↳ QDPSizeChangeProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

U11¹(X1, mark(X2)) → U11¹(X1, X2)
U11¹(active(X1), X2) → U11¹(X1, X2)
U11¹(X1, active(X2)) → U11¹(X1, X2)
U11¹(mark(X1), X2) → U11¹(X1, X2)

From the DPs we obtained the following set of size-change graphs:

U11¹(X1, mark(X2)) → U11¹(X1, X2)
The graph contains the following edges 1 >= 1, 2 > 2
U11¹(X1, active(X2)) → U11¹(X1, X2)
The graph contains the following edges 1 >= 1, 2 > 2
U11¹(active(X1), X2) → U11¹(X1, X2)
The graph contains the following edges 1 > 1, 2 >= 2
U11¹(mark(X1), X2) → U11¹(X1, X2)
The graph contains the following edges 1 > 1, 2 >= 2

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNat(V1), V2))
MARK(U12(X)) → MARK(X)
MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(isNat(X)) → ACTIVE(isNat(X))
MARK(U11(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)
ACTIVE(plus(N, 0)) → MARK(U31(isNat(N), N))
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U31(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X2)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(U11(X1, X2)) → ACTIVE(U11(mark(X1), X2))
MARK(U41(X1, X2, X3)) → MARK(X1)
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(plus(X1, X2)) → MARK(X1)
MARK(U21(X)) → MARK(X)
ACTIVE(U11(tt, V2)) → MARK(U12(isNat(V2)))
ACTIVE(plus(N, s(M))) → MARK(U41(isNat(M), M, N))
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))
ACTIVE(U31(tt, N)) → MARK(N)
MARK(U12(X)) → ACTIVE(U12(mark(X)))
MARK(U42(X1, X2, X3)) → MARK(X1)
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

ACTIVE(plus(N, 0)) → MARK(U31(isNat(N), N))

The remaining pairs can at least be oriented weakly.

ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNat(V1), V2))
MARK(U12(X)) → MARK(X)
MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(isNat(X)) → ACTIVE(isNat(X))
MARK(U11(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U31(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X2)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(U11(X1, X2)) → ACTIVE(U11(mark(X1), X2))
MARK(U41(X1, X2, X3)) → MARK(X1)
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(plus(X1, X2)) → MARK(X1)
MARK(U21(X)) → MARK(X)
ACTIVE(U11(tt, V2)) → MARK(U12(isNat(V2)))
ACTIVE(plus(N, s(M))) → MARK(U41(isNat(M), M, N))
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))
ACTIVE(U31(tt, N)) → MARK(N)
MARK(U12(X)) → ACTIVE(U12(mark(X)))
MARK(U42(X1, X2, X3)) → MARK(X1)
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))

Used ordering: Polynomial interpretation [25]:

POL(0) = 1
POL(ACTIVE(x₁)) = x₁
POL(MARK(x₁)) = x₁
POL(U11(x₁, x₂)) = x₁
POL(U12(x₁)) = x₁
POL(U21(x₁)) = x₁
POL(U31(x₁, x₂)) = x₁ + x₂
POL(U41(x₁, x₂, x₃)) = x₁ + x₂ + x₃
POL(U42(x₁, x₂, x₃)) = x₁ + x₂ + x₃
POL(active(x₁)) = x₁
POL(isNat(x₁)) = 0
POL(mark(x₁)) = x₁
POL(plus(x₁, x₂)) = x₁ + x₂
POL(s(x₁)) = x₁
POL(tt) = 0

The following usable rules [17] were oriented:

isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U21(active(X)) → U21(X)
U21(mark(X)) → U21(X)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U12(active(X)) → U12(X)
U12(mark(X)) → U12(X)
s(active(X)) → s(X)
s(mark(X)) → s(X)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)
plus(mark(X1), X2) → plus(X1, X2)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
mark(tt) → active(tt)
active(U31(tt, N)) → mark(N)
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U12(X)) → active(U12(mark(X)))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(U21(X)) → active(U21(mark(X)))
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(U11(tt, V2)) → mark(U12(isNat(V2)))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
mark(isNat(X)) → active(isNat(X))
active(isNat(0)) → mark(tt)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
MARK(U12(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNat(V1), V2))
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(U11(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
MARK(s(X)) → MARK(X)
MARK(U31(X1, X2)) → MARK(X1)
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(plus(X1, X2)) → MARK(X2)
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(U11(X1, X2)) → ACTIVE(U11(mark(X1), X2))
MARK(U41(X1, X2, X3)) → MARK(X1)
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(plus(X1, X2)) → MARK(X1)
MARK(U21(X)) → MARK(X)
ACTIVE(U11(tt, V2)) → MARK(U12(isNat(V2)))
ACTIVE(plus(N, s(M))) → MARK(U41(isNat(M), M, N))
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))
ACTIVE(U31(tt, N)) → MARK(N)
MARK(U12(X)) → ACTIVE(U12(mark(X)))
MARK(U42(X1, X2, X3)) → MARK(X1)
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

MARK(U31(X1, X2)) → MARK(X1)
ACTIVE(U31(tt, N)) → MARK(N)

The remaining pairs can at least be oriented weakly.

MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
MARK(U12(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNat(V1), V2))
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(U11(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
MARK(s(X)) → MARK(X)
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(plus(X1, X2)) → MARK(X2)
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(U11(X1, X2)) → ACTIVE(U11(mark(X1), X2))
MARK(U41(X1, X2, X3)) → MARK(X1)
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(plus(X1, X2)) → MARK(X1)
MARK(U21(X)) → MARK(X)
ACTIVE(U11(tt, V2)) → MARK(U12(isNat(V2)))
ACTIVE(plus(N, s(M))) → MARK(U41(isNat(M), M, N))
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))
MARK(U12(X)) → ACTIVE(U12(mark(X)))
MARK(U42(X1, X2, X3)) → MARK(X1)
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))

Used ordering: Polynomial interpretation [25]:

POL(0) = 1
POL(ACTIVE(x₁)) = x₁
POL(MARK(x₁)) = x₁
POL(U11(x₁, x₂)) = x₁
POL(U12(x₁)) = x₁
POL(U21(x₁)) = x₁
POL(U31(x₁, x₂)) = 1 + x₁ + x₂
POL(U41(x₁, x₂, x₃)) = x₁ + x₂ + x₃
POL(U42(x₁, x₂, x₃)) = x₁ + x₂ + x₃
POL(active(x₁)) = x₁
POL(isNat(x₁)) = 0
POL(mark(x₁)) = x₁
POL(plus(x₁, x₂)) = x₁ + x₂
POL(s(x₁)) = x₁
POL(tt) = 0

The following usable rules [17] were oriented:

isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U21(active(X)) → U21(X)
U21(mark(X)) → U21(X)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U12(active(X)) → U12(X)
U12(mark(X)) → U12(X)
s(active(X)) → s(X)
s(mark(X)) → s(X)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)
plus(mark(X1), X2) → plus(X1, X2)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
mark(tt) → active(tt)
active(U31(tt, N)) → mark(N)
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U12(X)) → active(U12(mark(X)))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(U21(X)) → active(U21(mark(X)))
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(U11(tt, V2)) → mark(U12(isNat(V2)))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
mark(isNat(X)) → active(isNat(X))
active(isNat(0)) → mark(tt)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
MARK(U12(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNat(V1), V2))
MARK(U11(X1, X2)) → ACTIVE(U11(mark(X1), X2))
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(U41(X1, X2, X3)) → MARK(X1)
MARK(U11(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
MARK(s(X)) → MARK(X)
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(plus(X1, X2)) → MARK(X1)
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U21(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(plus(X1, X2)) → MARK(X2)
ACTIVE(plus(N, s(M))) → MARK(U41(isNat(M), M, N))
ACTIVE(U11(tt, V2)) → MARK(U12(isNat(V2)))
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))
MARK(U42(X1, X2, X3)) → MARK(X1)
MARK(U12(X)) → ACTIVE(U12(mark(X)))
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

MARK(U41(X1, X2, X3)) → MARK(X1)
MARK(s(X)) → MARK(X)
MARK(U42(X1, X2, X3)) → MARK(X1)

The remaining pairs can at least be oriented weakly.

MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
MARK(U12(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNat(V1), V2))
MARK(U11(X1, X2)) → ACTIVE(U11(mark(X1), X2))
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(U11(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(plus(X1, X2)) → MARK(X1)
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U21(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(plus(X1, X2)) → MARK(X2)
ACTIVE(plus(N, s(M))) → MARK(U41(isNat(M), M, N))
ACTIVE(U11(tt, V2)) → MARK(U12(isNat(V2)))
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))
MARK(U12(X)) → ACTIVE(U12(mark(X)))
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))

Used ordering: Polynomial interpretation [25]:

POL(0) = 1
POL(ACTIVE(x₁)) = x₁
POL(MARK(x₁)) = x₁
POL(U11(x₁, x₂)) = x₁
POL(U12(x₁)) = x₁
POL(U21(x₁)) = x₁
POL(U31(x₁, x₂)) = x₂
POL(U41(x₁, x₂, x₃)) = 1 + x₁ + x₂ + x₃
POL(U42(x₁, x₂, x₃)) = 1 + x₁ + x₂ + x₃
POL(active(x₁)) = x₁
POL(isNat(x₁)) = 0
POL(mark(x₁)) = x₁
POL(plus(x₁, x₂)) = x₁ + x₂
POL(s(x₁)) = 1 + x₁
POL(tt) = 0

The following usable rules [17] were oriented:

isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U21(active(X)) → U21(X)
U21(mark(X)) → U21(X)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U12(active(X)) → U12(X)
U12(mark(X)) → U12(X)
s(active(X)) → s(X)
s(mark(X)) → s(X)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)
plus(mark(X1), X2) → plus(X1, X2)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
mark(tt) → active(tt)
active(U31(tt, N)) → mark(N)
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U12(X)) → active(U12(mark(X)))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(U21(X)) → active(U21(mark(X)))
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(U11(tt, V2)) → mark(U12(isNat(V2)))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
mark(isNat(X)) → active(isNat(X))
active(isNat(0)) → mark(tt)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
MARK(U12(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNat(V1), V2))
MARK(U11(X1, X2)) → ACTIVE(U11(mark(X1), X2))
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(U11(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(plus(X1, X2)) → MARK(X1)
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U21(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(plus(X1, X2)) → MARK(X2)
ACTIVE(U11(tt, V2)) → MARK(U12(isNat(V2)))
ACTIVE(plus(N, s(M))) → MARK(U41(isNat(M), M, N))
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))
MARK(U12(X)) → ACTIVE(U12(mark(X)))
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))

The remaining pairs can at least be oriented weakly.

MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
MARK(U12(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNat(V1), V2))
MARK(U11(X1, X2)) → ACTIVE(U11(mark(X1), X2))
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(U11(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(plus(X1, X2)) → MARK(X1)
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U21(X)) → MARK(X)
MARK(plus(X1, X2)) → MARK(X2)
ACTIVE(U11(tt, V2)) → MARK(U12(isNat(V2)))
ACTIVE(plus(N, s(M))) → MARK(U41(isNat(M), M, N))
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))
MARK(U12(X)) → ACTIVE(U12(mark(X)))
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))

Used ordering: Polynomial interpretation [25]:

POL(0) = 1
POL(ACTIVE(x₁)) = 0
POL(MARK(x₁)) = x₁
POL(U11(x₁, x₂)) = x₁
POL(U12(x₁)) = x₁
POL(U21(x₁)) = x₁
POL(U31(x₁, x₂)) = 1 + x₂
POL(U41(x₁, x₂, x₃)) = 0
POL(U42(x₁, x₂, x₃)) = 0
POL(active(x₁)) = x₁
POL(isNat(x₁)) = 0
POL(mark(x₁)) = x₁
POL(plus(x₁, x₂)) = x₁ + x₂
POL(s(x₁)) = 0
POL(tt) = 0

The following usable rules [17] were oriented:

isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U21(active(X)) → U21(X)
U21(mark(X)) → U21(X)
U11(mark(X1), X2) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U12(active(X)) → U12(X)
U12(mark(X)) → U12(X)
s(active(X)) → s(X)
s(mark(X)) → s(X)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
MARK(U12(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNat(V1), V2))
MARK(U11(X1, X2)) → ACTIVE(U11(mark(X1), X2))
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(U11(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(plus(X1, X2)) → MARK(X1)
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U21(X)) → MARK(X)
MARK(plus(X1, X2)) → MARK(X2)
ACTIVE(plus(N, s(M))) → MARK(U41(isNat(M), M, N))
ACTIVE(U11(tt, V2)) → MARK(U12(isNat(V2)))
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))
MARK(U12(X)) → ACTIVE(U12(mark(X)))
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNat(V1), V2))
MARK(U11(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X2)
ACTIVE(U11(tt, V2)) → MARK(U12(isNat(V2)))

The remaining pairs can at least be oriented weakly.

MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
MARK(U12(X)) → MARK(X)
MARK(U11(X1, X2)) → ACTIVE(U11(mark(X1), X2))
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U21(X)) → MARK(X)
ACTIVE(plus(N, s(M))) → MARK(U41(isNat(M), M, N))
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))
MARK(U12(X)) → ACTIVE(U12(mark(X)))
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))

Used ordering: Combined order from the following AFS and order.
MARK(x1) = x1
U41(x1, x2, x3) = U41(x2, x3)
ACTIVE(x1) = x1
mark(x1) = x1
U12(x1) = x1
isNat(x1) = isNat(x1)
plus(x1, x2) = plus(x1, x2)
U11(x1, x2) = U11(x1, x2)
U21(x1) = x1
tt = tt
U42(x1, x2, x3) = U42(x2, x3)
s(x1) = x1
active(x1) = x1
U31(x1, x2) = U31(x1, x2)
0 = 0

Recursive path order with status [2].
Quasi-Precedence:

[U41₂, plus₂, U42₂] > [isNat₁, U11₂] > tt
[U41₂, plus₂, U42₂] > U31₂

Status:

plus₂: [1,2]
U31₂: [2,1]
tt: multiset
U42₂: [2,1]
U41₂: [2,1]
U11₂: multiset
isNat₁: multiset
0: multiset

The following usable rules [17] were oriented:

isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U21(active(X)) → U21(X)
U21(mark(X)) → U21(X)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
mark(0) → active(0)
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
U11(mark(X1), X2) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U12(active(X)) → U12(X)
U12(mark(X)) → U12(X)
mark(tt) → active(tt)
active(U31(tt, N)) → mark(N)
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U12(X)) → active(U12(mark(X)))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(U21(X)) → active(U21(mark(X)))
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(U11(tt, V2)) → mark(U12(isNat(V2)))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
mark(isNat(X)) → active(isNat(X))
s(active(X)) → s(X)
s(mark(X)) → s(X)
active(isNat(0)) → mark(tt)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)
plus(mark(X1), X2) → plus(X1, X2)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
MARK(U12(X)) → MARK(X)
MARK(U11(X1, X2)) → ACTIVE(U11(mark(X1), X2))
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U21(X)) → MARK(X)
ACTIVE(plus(N, s(M))) → MARK(U41(isNat(M), M, N))
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))
MARK(U12(X)) → ACTIVE(U12(mark(X)))
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

MARK(U12(X)) → MARK(X)
MARK(U11(X1, X2)) → ACTIVE(U11(mark(X1), X2))
MARK(U12(X)) → ACTIVE(U12(mark(X)))
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))

The remaining pairs can at least be oriented weakly.

MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U21(X)) → MARK(X)
ACTIVE(plus(N, s(M))) → MARK(U41(isNat(M), M, N))
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))

Used ordering: Polynomial interpretation [25]:

POL(0) = 0
POL(ACTIVE(x₁)) = 1
POL(MARK(x₁)) = 1 + x₁
POL(U11(x₁, x₂)) = 1
POL(U12(x₁)) = 1 + x₁
POL(U21(x₁)) = x₁
POL(U31(x₁, x₂)) = x₁
POL(U41(x₁, x₂, x₃)) = 0
POL(U42(x₁, x₂, x₃)) = 0
POL(active(x₁)) = x₁
POL(isNat(x₁)) = 0
POL(mark(x₁)) = x₁
POL(plus(x₁, x₂)) = 1
POL(s(x₁)) = 0
POL(tt) = 0

The following usable rules [17] were oriented:

isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U21(active(X)) → U21(X)
U21(mark(X)) → U21(X)
s(active(X)) → s(X)
s(mark(X)) → s(X)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(isNat(X)) → ACTIVE(isNat(X))
MARK(s(X)) → ACTIVE(s(mark(X)))
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U21(X)) → MARK(X)
ACTIVE(plus(N, s(M))) → MARK(U41(isNat(M), M, N))
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

ACTIVE(plus(N, s(M))) → MARK(U41(isNat(M), M, N))

The remaining pairs can at least be oriented weakly.

MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(isNat(X)) → ACTIVE(isNat(X))
MARK(s(X)) → ACTIVE(s(mark(X)))
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U21(X)) → MARK(X)
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))

Used ordering: Polynomial interpretation [25]:

POL(0) = 0
POL(ACTIVE(x₁)) = x₁
POL(MARK(x₁)) = 0
POL(U11(x₁, x₂)) = 0
POL(U12(x₁)) = 0
POL(U21(x₁)) = 0
POL(U31(x₁, x₂)) = 0
POL(U41(x₁, x₂, x₃)) = 0
POL(U42(x₁, x₂, x₃)) = 0
POL(active(x₁)) = 0
POL(isNat(x₁)) = 0
POL(mark(x₁)) = 0
POL(plus(x₁, x₂)) = 1
POL(s(x₁)) = 0
POL(tt) = 0

The following usable rules [17] were oriented:

isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U21(active(X)) → U21(X)
U21(mark(X)) → U21(X)
s(active(X)) → s(X)
s(mark(X)) → s(X)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(isNat(X)) → ACTIVE(isNat(X))
MARK(s(X)) → ACTIVE(s(mark(X)))
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U21(X)) → MARK(X)
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

MARK(U21(X)) → ACTIVE(U21(mark(X)))
MARK(s(X)) → ACTIVE(s(mark(X)))

The remaining pairs can at least be oriented weakly.

MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U21(X)) → MARK(X)
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))

Used ordering: Polynomial interpretation [25]:

POL(0) = 0
POL(ACTIVE(x₁)) = x₁
POL(MARK(x₁)) = 1
POL(U11(x₁, x₂)) = 0
POL(U12(x₁)) = 0
POL(U21(x₁)) = 0
POL(U31(x₁, x₂)) = 0
POL(U41(x₁, x₂, x₃)) = 1
POL(U42(x₁, x₂, x₃)) = 1
POL(active(x₁)) = 0
POL(isNat(x₁)) = 1
POL(mark(x₁)) = 0
POL(plus(x₁, x₂)) = 0
POL(s(x₁)) = 0
POL(tt) = 0

The following usable rules [17] were oriented:

isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U21(active(X)) → U21(X)
U21(mark(X)) → U21(X)
s(active(X)) → s(X)
s(mark(X)) → s(X)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                                          ↳ QDP

                                            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U21(X)) → MARK(X)
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

MARK(U41(X1, X2, X3)) → ACTIVE(U41(mark(X1), X2, X3))

The remaining pairs can at least be oriented weakly.

MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U21(X)) → MARK(X)
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))

Used ordering: Polynomial interpretation [25]:

POL(0) = 0
POL(ACTIVE(x₁)) = 0
POL(MARK(x₁)) = x₁
POL(U11(x₁, x₂)) = x₁ + x₂
POL(U12(x₁)) = x₁
POL(U21(x₁)) = x₁
POL(U31(x₁, x₂)) = 0
POL(U41(x₁, x₂, x₃)) = 1
POL(U42(x₁, x₂, x₃)) = 0
POL(active(x₁)) = x₁
POL(isNat(x₁)) = 0
POL(mark(x₁)) = x₁
POL(plus(x₁, x₂)) = 0
POL(s(x₁)) = 0
POL(tt) = 0

The following usable rules [17] were oriented:

isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U21(active(X)) → U21(X)
U21(mark(X)) → U21(X)
s(active(X)) → s(X)
s(mark(X)) → s(X)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                                          ↳ QDP

                                            ↳ QDPOrderProof

                                              ↳ QDP

                                                ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))
ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U21(X)) → MARK(X)
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U42(tt, M, N)) → MARK(s(plus(N, M)))

The remaining pairs can at least be oriented weakly.

MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))
MARK(U21(X)) → MARK(X)
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))

Used ordering: Polynomial interpretation [25]:

POL(0) = 0
POL(ACTIVE(x₁)) = 1
POL(MARK(x₁)) = x₁
POL(U11(x₁, x₂)) = 0
POL(U12(x₁)) = 0
POL(U21(x₁)) = x₁
POL(U31(x₁, x₂)) = 0
POL(U41(x₁, x₂, x₃)) = 0
POL(U42(x₁, x₂, x₃)) = 1
POL(active(x₁)) = x₁
POL(isNat(x₁)) = 1
POL(mark(x₁)) = x₁
POL(plus(x₁, x₂)) = x₁
POL(s(x₁)) = 0
POL(tt) = 0

The following usable rules [17] were oriented:

isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U21(active(X)) → U21(X)
U21(mark(X)) → U21(X)
s(active(X)) → s(X)
s(mark(X)) → s(X)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                                          ↳ QDP

                                            ↳ QDPOrderProof

                                              ↳ QDP

                                                ↳ QDPOrderProof

                                                  ↳ QDP

                                                    ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))
MARK(U21(X)) → MARK(X)
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U41(tt, M, N)) → MARK(U42(isNat(N), M, N))
ACTIVE(isNat(s(V1))) → MARK(U21(isNat(V1)))

The remaining pairs can at least be oriented weakly.

MARK(isNat(X)) → ACTIVE(isNat(X))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))
MARK(U21(X)) → MARK(X)

Used ordering: Polynomial interpretation [25]:

POL(0) = 0
POL(ACTIVE(x₁)) = x₁
POL(MARK(x₁)) = x₁
POL(U11(x₁, x₂)) = 0
POL(U12(x₁)) = 0
POL(U21(x₁)) = x₁
POL(U31(x₁, x₂)) = 0
POL(U41(x₁, x₂, x₃)) = 1 + x₁
POL(U42(x₁, x₂, x₃)) = 0
POL(active(x₁)) = x₁
POL(isNat(x₁)) = 1 + x₁
POL(mark(x₁)) = x₁
POL(plus(x₁, x₂)) = 0
POL(s(x₁)) = 1 + x₁
POL(tt) = 1

The following usable rules [17] were oriented:

isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U21(active(X)) → U21(X)
U21(mark(X)) → U21(X)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                                          ↳ QDP

                                            ↳ QDPOrderProof

                                              ↳ QDP

                                                ↳ QDPOrderProof

                                                  ↳ QDP

                                                    ↳ QDPOrderProof

                                                      ↳ QDP

                                                        ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

MARK(isNat(X)) → ACTIVE(isNat(X))
MARK(U42(X1, X2, X3)) → ACTIVE(U42(mark(X1), X2, X3))
MARK(U21(X)) → MARK(X)

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                                          ↳ QDP

                                            ↳ QDPOrderProof

                                              ↳ QDP

                                                ↳ QDPOrderProof

                                                  ↳ QDP

                                                    ↳ QDPOrderProof

                                                      ↳ QDP

                                                        ↳ DependencyGraphProof

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

Q DP problem:
The TRS P consists of the following rules:

MARK(U21(X)) → MARK(X)

The TRS R consists of the following rules:

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
mark(U11(X1, X2)) → active(U11(mark(X1), X2))
mark(tt) → active(tt)
mark(U12(X)) → active(U12(mark(X)))
mark(isNat(X)) → active(isNat(X))
mark(U21(X)) → active(U21(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U41(X1, X2, X3)) → active(U41(mark(X1), X2, X3))
mark(U42(X1, X2, X3)) → active(U42(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2) → U11(X1, X2)
U11(X1, mark(X2)) → U11(X1, X2)
U11(active(X1), X2) → U11(X1, X2)
U11(X1, active(X2)) → U11(X1, X2)
U12(mark(X)) → U12(X)
U12(active(X)) → U12(X)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U21(mark(X)) → U21(X)
U21(active(X)) → U21(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(mark(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, mark(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, mark(X3)) → U41(X1, X2, X3)
U41(active(X1), X2, X3) → U41(X1, X2, X3)
U41(X1, active(X2), X3) → U41(X1, X2, X3)
U41(X1, X2, active(X3)) → U41(X1, X2, X3)
U42(mark(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, mark(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, mark(X3)) → U42(X1, X2, X3)
U42(active(X1), X2, X3) → U42(X1, X2, X3)
U42(X1, active(X2), X3) → U42(X1, X2, X3)
U42(X1, X2, active(X3)) → U42(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                                          ↳ QDP

                                            ↳ QDPOrderProof

                                              ↳ QDP

                                                ↳ QDPOrderProof

                                                  ↳ QDP

                                                    ↳ QDPOrderProof

                                                      ↳ QDP

                                                        ↳ DependencyGraphProof

                                                          ↳ QDP

                                                            ↳ UsableRulesProof

                                                              ↳ QDP

                                                                ↳ QDPSizeChangeProof

Q DP problem:
The TRS P consists of the following rules:

MARK(U21(X)) → MARK(X)

From the DPs we obtained the following set of size-change graphs:

MARK(U21(X)) → MARK(X)
The graph contains the following edges 1 > 1